Random ultrametric trees and applications
نویسندگان
چکیده
منابع مشابه
Random ultrametric trees and applications
Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time. We show how the boundary of an ultrametric tree, like any compact ultrametric space, can be represented in a simple way via the so-called comb metric. We display a variety of examples of random combs and explain...
متن کاملRandom trees and applications
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous’ theorem giving the convergence in distribution of the contour process of conditioned Galton-Watson trees towards the normalized Brownian excursion. We also briefly discuss applica...
متن کامل6 Ultrametric random field
Gaussian random field on general ultrametric space is introduced as a solution of pseudodifferential stochastic equation. Covariation of the introduced random field is computed with the help of wavelet analysis on ultrametric spaces. Notion of ultrametric Markovianity, which describes independence of contributions to random field from different ultrametric balls is introduced. We show that the ...
متن کاملTrees and ultrametric spaces: a categorical equivalence
There is a well-known correspondence between infinite trees and ultrametric spaces that comes from considering the end space of the tree. The correspondence is interpreted here as an equivalence between two categories, one of which encodes the geometry of trees at infinity and the other encodes the micro-geometry of complete ultrametric spaces. r 2003 Elsevier Inc. All rights reserved. MSC: pri...
متن کاملOptimal Random Matchings on Trees and Applications
In this paper we will consider tight upper and lower bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of its cardinality. Specifically, given two n sets of points R = {r1, ..., rn} and B = {b1, ..., bn} distributed uniformly and randomly on the m leaves of λ-Hierarchically Separated Trees with branching factor b such that e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Proceedings and Surveys
سال: 2017
ISSN: 2267-3059
DOI: 10.1051/proc/201760070